On the computational power of probabilistic and quantum branching program

نویسندگان

  • Farid M. Ablayev
  • Aida Gainutdinova
  • Marek Karpinski
  • Cristopher Moore
  • Chris Pollett
چکیده

In this paper we show that one-qubit polynomial time computations are as powerful as NC circuits. More generally, we define syntactic models for quantum and stochastic branching programs of bounded width and prove upper and lower bounds on their power. We show that any NC language can be accepted exactly by a width-2 quantum branching program of polynomial length, in contrast to the classical case where width 5 is necessary unless NC = ACC. This separates width-2 quantum programs from width-2 doubly stochastic programs as we show the latter cannot compute the middle bit of multiplication. Finally, we show that bounded-width quantum and stochastic programs can be simulated by classical programs of larger but bounded width, and thus are in NC. For read-once quantum branching programs (QBPs), we give a symmetric Boolean function which is computable by a read-once QBP with O(log n) width, but not by a deterministic read-once BP with o(n) width, or by a classical randomized read-once BP with o(n) width which is “stable” in the sense that its transitions depend on the value of the queried variable but do not vary from step to step. Finally, we present a general lower bound on the width of read-once QBPs, showing that our O(log n) upper bound for this symmetric function is almost tight. ∗Dept. of Theoretical Cybernetics, Kazan State University. [email protected] ; work done in part while visiting Institute of Advanced Study and Max-Planck Institute for Mathematics, supported in part by Russia Fund for Basic Research grant 03-01-00769 †Dept. of Theoretical Cybernetics, Kazan State University. [email protected]; supported in part by Russia Fund for Basic Research grant 03-01-00769 ‡Dept. of Computer Science, University of Bonn. [email protected]; supported in part by DFG grants, and IST grant 14036 (RAND-APX) §Computer Science Department, University of New Mexico, Albuquerque and the Santa Fe Institute [email protected]; supported by NSF grants PHY-0200909, CCR-0220070, and EIA-0218563 ¶Dept. of Computer Science San Jose State University. [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum vs. Classical Read-Once Branching Programs

The paper presents the first nontrivial upper and lower bounds for (nonoblivious) quantum read-once branching programs. It is shown that the computational power of quantum and classical read-once branching programs is incomparable in the following sense: (i) A simple, explicit boolean function on 2n input bits is presented that is computable by error-free quantum read-once branching programs of...

متن کامل

On Computational Power of Quantum Read-Once Branching Programs

In this paper we review our current results concerning the computational power of quantum read-once branching programs. First of all, based on the circuit presentation of quantum branching programs and our variant of quantum fingerprinting technique, we show that any Boolean function with linear polynomial presentation can be computed by a quantum read-once branching program using a relatively ...

متن کامل

A probabilistic nonequivalence test for syntactic (1,+k)-branching programs

We present a satissability test and a probabilistic nonequivalence test for syntactic (1; +k)-branching programs. The satissability test works in time at most O(? 4en k k sd), where s and d are the size and depth of the input branching program. The probabilistic nonequivalence test works in time O(? 12en k k sd log 2 n). The result has consequences also for parity syntactic (1; +k)-branching pr...

متن کامل

Evaluation of the effect of dendritic branching on signal processing in hippocampus pyramidal cells

Since branching region of an active nerve fiber is an abrupt widening of the structure, two concepts emerge: first, the stimulating current must be sufficient to raise the outgrowing fibers above the thresh¬old, and secondly, the stimulating current will be divided in proportion to the characteristic admittance of the branches. On the other hand, blocking of the nerve impulse in this region is ...

متن کامل

Evaluation of the effect of dendritic branching on signal processing in hippocampus pyramidal cells

Since branching region of an active nerve fiber is an abrupt widening of the structure, two concepts emerge: first, the stimulating current must be sufficient to raise the outgrowing fibers above the thresh¬old, and secondly, the stimulating current will be divided in proportion to the characteristic admittance of the branches. On the other hand, blocking of the nerve impulse in this region is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Comput.

دوره 203  شماره 

صفحات  -

تاریخ انتشار 2005